Separation Set Partitioning: Algorithm to Partition Nonstrict Programs into Sequential Threads
نویسندگان
چکیده
In this paper, we propose separation set partitioning algorithm for partitioning nonstrict programs into threads using participation set and separation set and extened it to global partitioning. Separation set partitioning algorithm can merge threads which dependence set and demand set partitioning algorithm may fail to merge. It deals with certain indirect depdendences and potential indirect dependence uniformly and its time complexity is O(n 2). Experimental results show that the larger threads are made by separation set partitioning than dependence set and demand set partitioning algoritms.
منابع مشابه
Separation Constraint Partitioning - A New Algorithm for PartitioningNon - strict Programs into Sequential
In this paper we present substantially improved thread partitioning algorithms for modern implicitly parallel languages. We present a new block partitioning algorithm, separation constraint partitioning, which is both more powerful and more exible than previous algorithms. Our algorithm is guaranteed to derive maximal threads. We present a theoretical framework for proving the correctness of ou...
متن کاملAn employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملAutomatically Partitioning Threads Based on Remote Paths
In order to program multithreaded architectures e ectively compiler support to automatically partition programs into threads is essential. This paper proposes a remote-path based thread partitioning framework, which can generate low-level threads from procedural programs automatically. The framework has been implemented in the EARTH-C compiler, which uses Data Dependence Graph (DDG) as an inter...
متن کاملDevelopment and Application of Aqueous Two-Phase Partition for the Recovery and Separation of Recombinant Phenylalanine Dehydrogenase
Aqueous two-phase systems (ATPS) have emerged as a powerful extraction method for the downstream processing of bio-molecules. The aim of this work was to investigate the possibility of utilizing ATPS for the separation of recombinant Bacillus sphaericus phenylalanine dehydrogenase (PheDH). Polyethylene glycol (PEG) and ammonium sulfate systems were selected for our experi...
متن کاملPartitioning Non-strict Functional Languages for Multi-threaded Code Generationy
In this paper, we present a new approach to partitioning, the problem of generating sequential threads for programs written in a non-strict functional language. The goal of partitioning is to generate threads as large as possible, while retaining the non-strict semantics of the program. We deene partitioning as a program transformation and design algorithms for basic block partitioning and inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997